Optimization in the Loop: Implementing and Testing Scheduling Algorithms with SimuLTE
نویسنده
چکیده
—One of the main purposes of discrete event simulators such as OMNeT++ is to test new algorithms or protocols in realistic environments. These often need to be benchmarked against optimal/theoretical results obtained by running commercial optimization solvers. The usual way to do this is to have the simulator run in a standalone mode and generate (few) snapshots, which are then fed to the optimization solvers. This allows one to compare the optimal and suboptimal solutions in the snapshots, but does not allow to assess how the system being studied would evolve over time if the optimal solution was enforced every time. This requires optimization software to run directly in the loop of the simulation, exchanging information with the latter. The goal of this tutorial is to show how to integrate a commercial solver (CPLEX) into the simulation loop of the OMNeT++ environment. For this purpose, we propose two methods: a first one that uses a solver as an external program, and a second one that exploits a C-written API for CPLEX known as Callable Library. We then exemplify how to apply these two methods to SimuLTE, a simulation model for LTE cellular networks, implementing and testing a simple solution to a well-known resource-scheduling problem.
منابع مشابه
Task Scheduling Using Particle Swarm Optimization Algorithm with a Selection Guide and a Measure of Uniformity for Computational Grids
In this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the Selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. Scheduling algorithms play an important role in grid computing, parallel tasks Scheduling and sending them to ...
متن کاملTask Scheduling Using Particle Swarm Optimization Algorithm with a Selection Guide and a Measure of Uniformity for Computational Grids
In this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the Selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. Scheduling algorithms play an important role in grid computing, parallel tasks Scheduling and sending them to ...
متن کاملProject scheduling optimization for contractor’s Net present value maximization using meta-heuristic algorithms: A case study
Today's competitive conditions have caused the projects to be carried out in the least possible time with limited resources. Therefore, managing and scheduling a project is a necessity for the project. The timing of a project is to specify a sequence of times for a series of related activities. According to their priority and their latency, so that between the time the project is completed and ...
متن کاملA multi-objective resource-constrained optimization of time-cost trade-off problems in scheduling project
This paper presents a multi-objective resource-constrained project scheduling problem with positive and negative cash flows. The net present value (NPV) maximization and making span minimization are this study objectives. And since this problem is considered as complex optimization in NP-Hard context, we present a mathematical model for the given problem and solve three evolutionary algorithms;...
متن کاملDesigning a Stochastic Multi-Product Closed Loop Supply Chain Network Considering the Discount and Solving Using the Firefly Algorithm with Decoding Based on Priority
The closed loop supply chain is becoming one of the industry's most important areas of business, due to environmental and business factors. Planning and implementing a closed loop supply chain network provide more profit, customer satisfaction, and a good social image to the company. While most supply chain networks are not equipped with back-up channels, this paper presents a mixed integer non...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1509.03562 شماره
صفحات -
تاریخ انتشار 2015